| 翻訳と辞書 |
| Travelling Salesman (2012 film) ： ウィキペディア英語版 |
Travelling Salesman (2012 film)
''Travelling Salesman'' is a 2012 intellectual thriller film about four mathematicians solving the P versus NP problem, one of the most challenging mathematical problems in history. The title refers to the Travelling salesman problem, an optimization problem that acts like a key to solving other mathematical problems that are thought to be hard; it has been proven that a quick travelling salesman algorithm, if one exists, could be converted into quick algorithms for many other difficult tasks, such as factoring large numbers. Since many cryptographic schemes rely on the difficulty of factoring integers to protect their data, this would allow access to private data like personal correspondence, bank accounts and, possibly, government secrets.
The story is written and directed by Timothy Lanzone and premiered at the International House in Philadelphia on Saturday, June 16. After screenings in 8 countries, spanning 4 continents, including screenings at the University of Pennsylvania and the University of Cambridge, the film was released globally on September 10, 2013.
== Plot ==
The four mathematicians are gathered and meet with a top official of the United States Department of Defense. After some discussion, the group agrees that they must be wary with whom to trust and control their solution. The official offers them a reward of $10 million in exchange for their portion of the algorithm, swaying them by attempting to address their concerns. Only one of the four speaks out against the sale, and in doing so is forced to reveal a dark truth about his portion of the solution. Before they sign a license to the government, however, they wrestle with the ethical consequences of their discovery.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Travelling Salesman (2012 film)」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|